Fast decoding of the Leech lattice
نویسندگان
چکیده
New efficient algorithm for maximum likelihood soft-decision decoding of the Leech lattice is presented. The superiority of this decoder with respect to both computational and memory complexities, compared to previously published decoding methods is demonstrated. Gain factors in the range of 2-10 are achieved. The Leech lattice has been recently suggested for practical implementation of block-coded modulation and the decoder is described here in that context.
منابع مشابه
Reduced Complexity Bounded .Distance Decoding of the Leech Lattice
A bstmct-A new efficient algorithm for bounded-distance decoding of the Leech la t t ice is presented. The algori thm decodes correctly at least ulp to the guaranteed error-correction radius of the Leech lattice. The proposed decoder is based on projecting the points of the Leech lattice onto the codewords of the (6,3,4) quar te rnary code, the hezacode Ne. Project ion on the hexacode induces p...
متن کاملEfficient bounded-distance decoding of the hexacode and associated decoders for the Leech lattice and the Golay code
Abstmct Two soft-decision algorithms f o r decoding the (6,3,4) q u a t e r n a r y code, the hezocode, are p resented. Both algorithms have the same guaranteed error cor rec t ion radius as that of maximum-likelihood decoding. In using them, bounded-distance decoding of the Golay code and the Leech lattice are performed i n at most 187 and 519 real operations respectively. We present s o m e s...
متن کاملA coding scheme for single peak-shift correction in (d, k)-constrained channels
I J. P. Adoul and M. Barth, “Nearest neighbor algorithm for spherical codes from the Leech lattice,” IEEE Trans. Inform. Theory, vol. 34, pt. 11, pp. 1188-1202, Sept. 1988. Y. Be’ery and B. Shahar, “VLSI Architectures for soft decoding of the Leech lattice and the Golay codes,” Proc. IEEE Int. Workshop on Microekctronics in Commun, Interlaken, Switzerland, Mar. 1991. Y. Be’ery, B. Shahar, and J...
متن کاملSoft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
This paper considers two kinds of algorithms. (i) If # is a binary code of length n, a ‘‘soft decision’’ decoding algorithm for # changes an arbitrary point of Rn into a nearest codeword (nearest in Euclidean distance). (ii) Similarly a decoding algorithm for a lattice Λ in Rn changes an arbitrary point of Rn into a closest lattice point. Some general methods are given for constructing such alg...
متن کاملThe Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
Abstmct-Multilevel constructions of the binary Golay code and the Leech lattice are described. Both constructions are based upon the prvjection of the Golay code and the Leech lattice onto the (6,3,4) hexacode over GF(4). However, unlike the previously reported constructiods, the new multilevel constructions make the three levels independent by way of using a didlerent set of coset representati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Journal on Selected Areas in Communications
دوره 7 شماره
صفحات -
تاریخ انتشار 1989